Predictive learning via rule ensembles
نویسندگان
چکیده
منابع مشابه
PREDICTIVE LEARNING VIA RULE ENSEMBLES By Jerome
General regression and classification models are constructed as linear combinations of simple rules derived from the data. Each rule consists of a conjunction of a small number of simple statements concerning the values of individual input variables. These rule ensembles are shown to produce predictive accuracy comparable to the best methods. However, their principal advantage lies in interpret...
متن کاملSoft Rule Ensembles for Statistical Learning
In this article supervised learning problems are solved using soft rule ensembles. We first review the importance sampling learning ensembles (ISLE) approach that is useful for generating hard rules. The soft rules are obtained with logistic regression using the corresponding hard rules. Soft rules are useful when both the response and the input variables are continuous because the soft rules p...
متن کاملAccuracy-based Learning Classifier System Ensembles with Rule-Sharing
This paper presents an investigation into exploiting the population-based nature of Learning Classifier Systems for their use within highly-parallel systems. In particular, the use of simple accuracy-based Learning Classifier Systems within the ensemble machine approach is examined. Results indicate that inclusion of a rule migration mechanism inspired by Parallel Genetic Algorithms is an effec...
متن کاملLearning Rule Ensembles for Ordinal Classification with Monotonicity Constraints
Ordinal classification problems with monotonicity constraints (also referred to as multicriteria classification problems) often appear in real-life applications, however, they are considered relatively less frequently in theoretical studies than regular classification problems. We introduce a rule induction algorithm based on the statistical learning approach that is tailored for this type of p...
متن کاملCramer’s Rule and Loop Ensembles
We review a 1986 result of G.X Viennot that expresses a ratio of generating functions for disjoint oriented loops in a finite graph in terms of the generating function of a single path in the graph weighted according to loops in the path, defined by loop erasure. The result is a generalisation of Cramer’s formula for the inverse of a matrix. We show that it arises from the Mayer expansion.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Statistics
سال: 2008
ISSN: 1932-6157
DOI: 10.1214/07-aoas148